Set Cover with Almost Consecutive Ones Property 2004
نویسنده
چکیده
The Set Cover problem has as input a set R of m items, a set C of n subsets of R and a weight function w : C → IR. The task is to choose a subset C ′ ⊆ C of minimum weight whose union contains all items of R. The sets R and C can be represented by an m × n binary matrix A that consists of a row for every item in R and a column for every subset of R in C, where an entry ai,j is 1 iff the ith item in R is part of the jth subset in C. Therefore, the Set Cover problem can be formulated as follows.
منابع مشابه
Set covering with almost consecutive ones property
In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecuti...
متن کاملStation Location - Complexity and Approximation
We consider a geometric set covering problem. In its original form it consists of adding stations to an existing geometric transportation network so that each of a given set of settlements is not too far from a station. The problem is known to be NP-hard in general. However, special cases with certain properties have been shown to be efficiently solvable in theory and in practice, especially if...
متن کاملMinimum Membership Set Covering and the Consecutive Ones Property
The Minimum Membership Set Cover problem has recently been introduced and studied in the context of interference reduction in cellular networks. It has been proven to be notoriously hard in several aspects. Here, we investigate how natural generalizations and variations of this problem behave in terms of the consecutive ones property: While it is well-known that classical set covering problems ...
متن کاملRed - Blue Covering Problems and the Consecutive Ones Property 1
Set Cover problems are of core importance in many applications. In recent research, the “red-blue variants” where blue elements all need to be covered whereas red elements add further constraints on the optimality of a covering have received considerable interest. Application scenarios range from data mining to interference reduction in cellular networks. As a rule, these problem variants are c...
متن کاملSolving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core problem is a geometric set covering problem which is NP-hard in general. However, if the corresponding covering matrix has the consecutive ones property, it is solvable in polynomial time. In this paper, we present data re...
متن کامل